Mappings Between Domain Models in Answer Set Programming
نویسندگان
چکیده
Integration of data is required when accessing multiple databases within an organization or on the WWW. Schema integration is required for database interoperability, but it is currently, a manual process. The so-called Global-as-View approach constitutes an effective proposal for the design of data integration systems. The combination of diverse database schemata into an integrated view is achieved by means of a global conceptual data model. Consequently, the user is provided with a unified view of the data and (s)he can query such a global schema ignoring the location and structure of the data sources. However, data integration involves resolving conflicts. Schema conflicts include naming, structural, and semantic conflicts. Then, when trying to answer a query in a data integration system, various forms of incompleteness and/or uncertainty may arise. This work aims at demonstrating that Answer Set Programming is a suitable paradigm for defining and implementing data integration systems. In particular, we define a formalization of the Global-as-View approach which is able to cope with forms of incompleteness in data correspondence. We present a working inference engine for effectively answering queries, where each answer set corresponds to one of the possible consistent answers to the given query.
منابع مشابه
Characterization of weak fixed point property for new class of set-valued nonexpansive mappings
In this paper, we introduce a new class of set-valued mappings which is called MD-type mappings. This class of mappings is a set-valued case of a class of the D-type mappings. The class of D-type mappings is a generalization of nonexpansive mappings that recently introduced by Kaewkhao and Sokhuma. The class of MD-type mappings includes upper semi-continuous Suzuki type mappings, upper semi-con...
متن کاملSynonymus Theories in Answer Set Programming and Equilibrium Logic
The study of strong equivalence between logic programs or nonmonotonic theories under answer set semantics, begun in [18], is extended to the case where the programs or theories concerned are formulated in different languages. We suggest that theories in different languages be considered equivalent in the strong sense or synonymous if and only if each is bijectively interpretable (hence transla...
متن کاملStrict fixed points of '{C}iri'{c}-generalized weak quasicontractive multi-valued mappings of integral type
Many authors such as Amini-Harandi, Rezapour et al., Kadelburg et al., have tried to find at least one fixed point for quasi-contractions when $alphain[frac{1}{2}, 1)$ but no clear answer exists right now and many of them either have failed or changed to a lighter version. In this paper, we introduce some new strict fixed point results in the set of multi-valued '{C}iri'{c}-gener...
متن کاملReducing Inductive Definitions to Propositional Satisfiability
The FO(ID) logic is an extension of classical first-order logic with a uniform representation of various forms of inductive definitions. The definitions are represented as sets of rules and they are interpreted by two-valued well-founded models. For a large class of combinatorial and search problems, knowledge representation in FO(ID) offers a viable alternative to the paradigm of Answer Set Pr...
متن کاملComparing Disjunctive Well-founded Semantics
While the stable model semantics, in the form of Answer Set Programming, has become a successful semantics for disjunctive logic programs, a corresponding satisfactory extension of the well-founded semantics to disjunctive programs remains to be found. The many current proposals for such an extension are so diverse, that even a systematic comparison between them is a challenging task. In order ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003